Krylov-Subspace Recycling via the POD-Augmented Conjugate-Gradient Method
نویسندگان
چکیده
منابع مشابه
Krylov-subspace recycling via the POD-augmented conjugate-gradient algorithm
This work presents a new Krylov-subspace-recycling method for efficiently solving sequences of linear systems of equations characterized by a non-invariant symmetric-positive-definite matrix. As opposed to typical truncation strategies used in recycling such as deflation, we propose a truncation method inspired by goal-oriented proper orthogonal decomposition (POD) from model reduction. This id...
متن کاملAn augmented subspace Conjugate Gradient
Many scientiic applications require to solve successively linear systems Ax = b with diierent right-hand sides b and a symmetric positive deenite matrix A. The Conjugate Gradient method applied to the rst system generates a Krylov subspace which can be eeciently recycled thanks to orthogonal projections in subsequent systems. A modiied Conjugate Gradient method is then applied with a speciic in...
متن کاملDeflated and Augmented Krylov Subspace Techniques
We present a general framework for a number of techniques based on projection methods onàugmented Krylov subspaces'. These methods include the deeated GM-RES algorithm, an inner-outer FGMRES iteration algorithm, and the class of block Krylov methods. Augmented Krylov subspace methods often show a signiicant improvement in convergence rate when compared with their standard counterparts using the...
متن کاملAnalysis of Augmented Krylov Subspace Methods
Residual norm estimates are derived for a general class of methods based on projection techniques on subspaces of the form K m + W, where K m is the standard Krylov subspace associated with the original linear system, and W is some other subspace. Thesèaugmented Krylov subspace methods' include eigenvalue deeation techniques as well as block-Krylov methods. Residual bounds are established which...
متن کاملConjugate Gradient with Subspace Optimization
In this paper we present a variant of the conjugate gradient (CG) algorithm in which we invoke a subspace minimization subproblem on each iteration. We call this algorithm CGSO for “conjugate gradient with subspace optimization”. It is related to earlier work by Nemirovsky and Yudin. We apply the algorithm to solve unconstrained strictly convex problems. As with other CG algorithms, the update ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Matrix Analysis and Applications
سال: 2016
ISSN: 0895-4798,1095-7162
DOI: 10.1137/16m1057693